Cone-Constrained Continuous-Time Markowitz Problems
نویسندگان
چکیده
منابع مشابه
Solving inverse cone-constrained eigenvalue problems
We compare various algorithms for constructing a matrix of order n whose Pareto spectrum contains a prescribed set Λ = {λ1, . . . , λp} of reals. In order to avoid overdetermination one assumes that p does not exceed n2. The inverse Pareto eigenvalue problem under consideration is formulated as an underdetermined system of nonlinear equations. We also address the issue of computing Lorentz spec...
متن کاملCone-constrained eigenvalue problems: theory and algorithms
Equilibria in mechanics or in transportation models are not always expressed through a system of equations, but sometimes they are characterized by means of complementarity conditions involving a convex cone. This work deals with the analysis of cone-constrained eigenvalue problems. We discuss some theoretical issues like, for instance, the estimation of the maximal number of eigenvalues in a c...
متن کاملUnsymmetric Ordering Using A Constrained Markowitz Scheme
We consider the LU factorization of unsymmetric sparse matrices using a threephase approach (analysis, factorization and triangular solution). Usually the analysis phase first determines a set of potentially good pivot and then orders this set of pivots to decrease the fill-in in the factors. In this paper, we present a preprocessing algorithm that simultaneously achieves the objectives of sele...
متن کاملPseudoconvex Multiobjective Continuous-time Problems and Vector Variational Inequalities
In this paper, the concept of pseudoconvexity and quasiconvexity for continuous~-time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming problems are presented. Finally, some characterizations of the soluti...
متن کاملNew continuous-time and discrete-time mathematical formulations for resource-constrained project scheduling problems
Two binary integer programming discrete-time models and two precedence-based mixed integer programming continuous-time formulations are developed for the resource-constrained project scheduling problem. The discrete-time models are based on the definition of binary variables that describe the processing state of every activity between two consecutive time points, while the continuous-time model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2012
ISSN: 1556-5068
DOI: 10.2139/ssrn.2084753